Weighted Zernike polynomial fitting in steep corneas sampled in Cartesian grid
نویسندگان
چکیده
منابع مشابه
Multivariate Locally Weighted Polynomial Fitting and Partial Derivative Estimation
Nonparametric regression estimator based on locally weighted least squares fitting has been studied by Fan and Ruppert and Wand. The latter paper also studies, in the univariate case, nonparametric derivative estimators given by a locally weighted polynomial fitting. Compared with traditional kernel estimators, these estimators are often of simpler form and possess some better properties. In th...
متن کاملPolynomial Fitting for Edge Detection in Irregularly Sampled Signals and Images
We propose a new edge detection method that is effective on multivariate irregular data in any domain. The method is based on a local polynomial annihilation technique and can be characterized by its convergence to zero for any value away from discontinuities. The method is numerically cost efficient and entirely independent of any specific shape or complexity of boundaries. Application of the ...
متن کاملZernike polynomial fitting fails to represent all visually significant corneal aberrations.
PURPOSE It is assumed that wavefront error data arising from aberrometry are adequately described by a Zernike polynomial function, although this assumption has not been extensively tested. Inaccuracies in wavefront error may compromise clinical testing and refractive correction procedures. The current retrospective study correlates visual acuity with corneal wavefront error and with the residu...
متن کاملEmbedding Features in a Cartesian Grid
Grid-based mesh generation methods have been available for many years and can provide a reliable method for meshing arbitrary geometries with hexahedral elements. The principal use for these methods has mostly been limited to biological-type models where topology that may incorporate sharp edges and curve definitions are not critical. While these applications have been effective, robust generat...
متن کاملAdditive Sparse Grid Fitting
We propose an iterative algorithm for high-dimensional sparse grid regression with penalty. The algorithm is of additive Schwarz type and is thus parallel. We show that the convergence of the algorithm is better than additive Schwarz and examples demonstrate that convergence is between that of additive Schwarz and multiplicative Schwarz procedures. Similarly, the method shows improved performan...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Modern Optics
سال: 2011
ISSN: 0950-0340,1362-3044
DOI: 10.1080/09500340.2011.556263